翻訳と辞書 Words near each other ・ Sutherland's River, Nova Scotia ・ Sutherland, Iowa ・ Sutherland, Nebraska ・ Sutherland, New South Wales ・ Sutherland, Northern Cape ・ Sutherland, Ross and Cromarty (Commonwealth Parliament constituency) ・ Sutherland, Saskatoon ・ Sutherland, Tennessee ・ Sutherland, Utah ・ Sutherland, Virginia ・ Sutherland, Wisconsin ・ Sutherlandia ・ Sutherlandia frutescens ・ Sutherlands Creek, Victoria ・ Sutherlands, South Australia ・ Sutherland–Hodgman algorithm ・ Sutherlin ・ Sutherlin Alliance ・ Sutherlin Bank Building ・ Sutherlin Cabin ・ Sutherlin High School ・ Sutherlin, Oregon ・ Sutherlin, Virginia ・ Suthfeld ・ Suthi Veerabhadra Rao ・ Suthida Vajiralongkorn ・ Suthivelu ・ Suthora ・ Suthumalai ・ Suti (Vidhan Sabha constituency) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Sutherland–Hodgman algorithm ： ウィキペディア英語版 Sutherland–Hodgman algorithm The Sutherland–Hodgman algorithm is used for clipping polygons. It works by extending each line of the convex ''clip polygon'' in turn and selecting only vertices from the ''subject polygon'' that are on the visible side. ==Description== The algorithm begins with an input list of all vertices in the subject polygon. Next, one side of the clip polygon is extended infinitely in both directions, and the path of the subject polygon is traversed. Vertices from the input list are inserted into an output list if they lie on the visible side of the extended clip polygon line, and new vertices are added to the output list where the subject polygon path crosses the extended clip polygon line. This process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next. Once all sides of the clip polygon have been processed, the final generated list of vertices defines a new single polygon that is entirely visible. Note that if the subject polygon was concave at vertices outside the clipping polygon, the new polygon may have coincident (i.e. overlapping) edges – this is acceptable for rendering, but not for other applications such as computing shadows. The Weiler–Atherton algorithm overcomes this by returning a set of divided polygons, but is more complex and computationally more expensive, so Sutherland–Hodgman is used for many rendering applications. Sutherland–Hodgman can also be extended into 3D space by clipping the polygon paths based on the boundaries of planes defined by the viewing space. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sutherland–Hodgman algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.